Sensitivity and computational complexity in financial networks

نویسندگان

  • Brett Hemenway
  • Sanjeev Khanna
چکیده

Determining the causes of instability and contagion in financial networks is necessary to inform policy and avoid future financial collapse. In the American Economic Review, Elliott, Golub and Jackson proposed a simple model for capturing the dynamics of complex financial networks. In Elliott, Golub and Jackson’s model, the institutions in the network are connected by linear dependencies (cross-holdings) and if any institution’s value drops below a critical threshold, its value suffers an additional failure cost. This work shows that even in this simple model there are fundamental barriers to understanding the risks that are inherent in a network. First, if institutions are not required to maintain a minimum amount of self-holdings, any change in investments by a single institution can have an arbitrarily magnified influence on the net worth of the institutions in the system. This implies that if institutions have small selfholdings, then estimating the market value of an institution requires almost perfect information about every cross-holding in the system. Second, Even if a regulator has complete information about all cross-holdings in the system, it may be computationally intractable to estimate the number of failures that could be caused by a small shock to the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid computational intelligence model for foreign exchange rate forecasting

Computational intelligence approaches have gradually established themselves as a popular tool for forecasting the complicated financial markets. Forecasting accuracy is one of the most important features of forecasting models; hence, never has research directed at improving upon the effectiveness of time series models stopped. Nowadays, despite the numerous time series forecasting models propos...

متن کامل

The Computational Complexity of Clearing Financial Networks with Credit Default Swaps

We consider the problem of clearing a system of interconnected banks. Prior work has shown that when banks can only enter into simple debt contracts with each other, then a clearing vector of payments can be computed in polynomial time. In this work, we show that the computational complexity of the clearing problem drastically increases when banks can also enter into credit default swaps (CDSs)...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

A hybrid model based on machine learning and genetic algorithm for detecting fraud in financial statements

Financial statement fraud has increasingly become a serious problem for business, government, and investors. In fact, this threatens the reliability of capital markets, corporate heads, and even the audit profession. Auditors in particular face their apparent inability to detect large-scale fraud, and there are various ways to identify this problem. In order to identify this problem, the majori...

متن کامل

Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)

This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Algorithmic Finance

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2016